Construction of Optimal Linear Codes by Geometric Puncturing

نویسنده

  • Tatsuya Maruta
چکیده

Geometric puncturing is a method to construct new codes from a given [n, k, d]q code by deleting the coordinates corresponding to some geometric object in PG(k − 1, q). We construct [gq(4, d), 4, d]q and [gq(4, d)+1, 4, d]q codes for some d by geometric puncturing, where gq(k, d) = ∑k−1 i=0 ⌈

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rate-Compatible Punctured Polar Codes: Optimal Construction Based on Polar Spectra

Polar codes are the first class of constructive channel codes achieving the symmetric capacity of the binary-input discrete memoryless channels. But the corresponding code length is limited to the power of two. In this paper, we establish a systematic framework to design the rate-compatible punctured polar (RCPP) codes with arbitrary code length. A new theoretic tool, called polar spectra, is p...

متن کامل

Geometric Construction Codes of Hamming Distance-8

A new high rate binary linear block code construction technique, named as Geometric Construction (GC) codes, was proposed recently [1]. It generates all the even full information rate (optimal) Hamming distance – 4 codes. In this paper, we have enhanced the construction of GC codes with respect to code rate and derived a code family of hamming distance-8 GC codes.

متن کامل

Convolutional Codes: Techniques of Construction

In this paper we show how to construct new convolutional codes from old ones by applying the well-known techniques: puncturing, extending, expanding, direct sum, the (u|u + v) construction and the product code construction. By applying these methods, several new families of convolutional codes can be constructed. As an example of code expansion, families of convolutional codes derived from clas...

متن کامل

On the properness of some optimal binary linear codes and their dual codes

A linear code is said to be proper in error detection over a symmetric memoryless channel if its undetected error probability is an increasing function of the channel symbol error probability. A proper code performs well in error detection in the sense that the better the channel, the better the performance, which makes the code appropriate for use in channels where the symbol error probability...

متن کامل

Improved regular and semi-random rate-compatible low-density parity-check codes with short block lengths

Powerful rate-compatible codes are essential for achieving high throughput in hybrid automatic repeat request (ARQ) systems for networks utilising packet data transmission. The paper focuses on the construction of efficient rate-compatible low-density parity-check (RC-LDPC) codes over a wide range of rates. Two LDPC code families are considered; namely, regular LDPC codes which are known for go...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013